翻訳と辞書 Words near each other ・ Table of organization and equipment ・ Table of organization and equipment for an ADC company ・ Table of permselectivity for different substances ・ Table of political parties in Europe by pancontinental organisation ・ Table of polyhedron dihedral angles ・ Table of precedence for Barbados ・ Table of precedence for the Commonwealth of Australia ・ Table of precedence for the People's Republic of Bangladesh ・ Table of precedence of Negeri Sembilan ・ Table of precedence of Perak ・ Table of precedence of Sabah ・ Table of precedence of Sarawak ・ Table of prime factors ・ Table of prophets of Abrahamic religions ・ Table of Ranks ・ Table of simple cubic graphs ・ Table of spherical harmonics ・ Table of standard reduction potentials for half-reactions important in biochemistry ・ Table of stars with Bayer designations ・ Table of stars with Flamsteed designations ・ Table of Teenage Mutant Ninja Turtles character appearances ・ Table of the Elements ・ Table of the largest known graphs of a given diameter and maximal degree ・ Table of thermodynamic equations ・ Table of vertex-symmetric digraphs ・ Table of volume of distribution for drugs ・ Table of voting systems by country ・ Table of vowels ・ Table of World Heritage Sites by country ・ Table of years in archaeology Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Table of simple cubic graphs ： ウィキペディア英語版 Table of simple cubic graphs The connected 3-regular (cubic) simple graphs are listed for small vertex numbers. ==Connectivity== The number of simple cubic graphs on 4, 6, 8, 10,... vertices is 1, 2, 5, 19,... . A classification according to edge connectivity is made as follows: the 1-connected and 2-connected graphs are defined as usual. This leaves the other graphs in the 3-connected class because each 3-regular graph can be split by cutting all edges adjacent to any of the vertices. To refine this definition in the light of the algebra of coupling of angular momenta (see below), a subdivision of the 3-connected graphs is helpful. We shall call * Non-trivially 3-connected those that can be split by 3 edge cuts into sub-graphs with at least two vertices remaining in each part * Cyclically 4-connected—all those not 1-connected, not 2-connected, and not non-trivially 3-connected This declares the numbers 3 and 4 in the fourth column of the tables below. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Table of simple cubic graphs」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.